Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions
نویسندگان
چکیده
منابع مشابه
Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions
A normal quartic polynomial is a quartic polynomial whose fourth degree term coefficient tensor is positive definite. Its minimization problem is one of the simplest cases of nonconvex global optimization, and has engineering applications. We call a direction a global descent direction of a function at a point if there is another point with a lower function value along this direction. For a nor...
متن کاملGlobal Optimization of Polynomials
Recall we were considering the problem minz∈Rn p(z) where p(z) is a degree 2m polynomial such that p(z) = ∑ |α|≤2m pαz , where α = (α1, . . . , αn) is a vector of exponents, using the notation that z = z1 1 . . . z αn n . One equivalent way of expressing this problem is to notice this is the same as minimizing ∫ p(z)μ(dz) over the set of all probability distributions μ and note that it’s equiva...
متن کاملGlobal Optimization with Polynomials
The class of POP (Polynomial Optimization Problems) covers a wide rang of optimization problems such as 0− 1 integer linear and quadratic programs, nonconvex quadratic programs and bilinear matrix inequalities. In this paper, we review some methods on solving the unconstraint case: minimize a real-valued polynomial p(x) : R → R, as well the constraint case: minimize p(x) on a semialgebraic set ...
متن کاملSplitting of Quartic Polynomials
For integers r, s, t, u define the recursion A(n + 4) = rA(n + 3) sA(n + 2) + tA(n + 1) uA(n) where the initial conditions are set up in such a way that A(n) = a" + ß" + y" + S" where a, ß, y, S are the roots of the associated polynomial f(x) = x* rxi + sx2 tx + u. In this paper a detailed deterministic procedure using the A(n) for finding how f(x) splits modulo a prime integerp is given. This ...
متن کاملLink Prediction using Network Embedding based on Global Similarity
Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2004
ISSN: 1052-6234,1095-7189
DOI: 10.1137/s1052623403420857